Estimating Waiting times with the Time-varying Little’s Law
نویسنده
چکیده
When waiting times cannot be observed directly, Little’s law can be applied to estimate the average waiting time by the average number in system divided by the average arrival rate, but that simple indirect estimator tends to be biased significantly when the arrival rates are timevarying and the service times are relatively long. Here it is shown that the bias in that indirect estimator can be estimated and reduced by applying the time-varying Little’s law (TVLL). If there is appropriate time-varying staffing, then the waiting time distribution may not be timevarying even though the arrival rate is time varying. Given a fixed waiting time distribution with unknown mean, there is a unique mean consistent with the TVLL for each time t. Thus, under that condition, the TVLL provides an estimator for the unknown mean wait, given estimates of the average number in system over a subinterval and the arrival rate function. Useful variants of the TVLL estimator are obtained by fitting a linear or quadratic function to arrival data. When the arrival rate function is approximately linear (quadratic), the mean waiting time satisfies a quadratic (cubic) equation. The new estimator based on the TVLL is a positive real root of that equation. The new methods are shown to be effective in estimating the bias in the indirect estimator and reducing it, using simulations of multi-server queues and data from a call center.
منابع مشابه
Statistical Analysis with Little's Law
The theory supporting Little’s Law (L = W ) is now well developed, applying to both limits of averages and expected values of stationary distributions, but applications of Little’s Law with actual system data involve measurements over a finite-time interval, which are neither of these. We advocate taking a statistical approach with such measurements. We investigate how estimates of L and can...
متن کاملOn the FCLT Version of L = λW
The functional central limit theorem (FCLT) version of Little’s law (L = λW ) shows that the fundamental relation between cumulative processes underlying L = λW leads to a corresponding relation among the limits for the FCLT-scaled stochastic processes. It supports statistical analysis, e.g., estimating confidence intervals. Here, this statistical motivation is reviewed and then the FCLT in Gly...
متن کاملA Polling Model with Reneging at Polling Instants
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that we consider the reneging of customers at polling instants. In more detail, whenever the server starts or ends a visit to a queue, some of the customers waiti...
متن کاملManaging Service Systems with an Offline Waiting Option and Customer Abandonment
M service providers offer customers the choice of either waiting in a line or going offline and returning at a dynamically determined future time. The best-known example is the FASTPASS® system at Disneyland. To operate such a system, the service provider must make an upfront decision on how to allocate service capacity between the two lines. Then, during system operation, he must provide estim...
متن کاملExtending the FCLT version of L = λ
The functional central limit theorem (FCLT) version of Little’s law (L = λW ) established by Glynn and Whitt is extended to show that a bivariate FCLT for the number in the system and the waiting times implies the joint FCLT for all processes. It is based on a converse to the preservation of convergence by the composition map with centering on the function space containing the sample paths, exp...
متن کامل